A Distributed Path-Finding Algorithm for Distributed Metabolic Pathways
نویسندگان
چکیده
منابع مشابه
Distributed Path Consensus Algorithm
Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...
متن کاملA Distributed Shortest Path Algorithm for a Planar Network
An algorithm is presemed for finding a single source shortest path tree in a planar undirected distributed network with nonnegative edge COSlS. The number of messages used by the algorithm is 0 (n 513) on an n-node network.' Distributed algorithms are also presemed for finding a breadth-first spanning tree in a general network, for finding a shortest path tree in a general network, for finding ...
متن کاملDistributed Commuting Augmented Shortest Path Finding for Geo Spatial Datasets
Geo Spatial information is a large collection of datasets referring to the real world entities. Geo Spatial information has evolved in the last decade which led to produce a vast platform in Government Administration, Scientific Analysis and other various sectors especially in disaster management (DM), site suitability of Check-dams for Irrigation Department etc. It is required to obtain impera...
متن کاملA Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition
Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...
متن کاملDistributed Shortest-Path Finding by a Micro-robot Swarm
This paper describes a distributed algorithm for solving the shortest path problem with a swarm of JASMINE micro-robots. Each robot is only connected via infra-red communication with its neighbours. Based on local information exchange and some simple rules the swarm manages to find the shortest path (shortest path in the number of robots on the path) in a labyrinth with dead-ends and cycles. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Intelligent Systems
سال: 2005
ISSN: 1976-9172
DOI: 10.5391/jkiis.2005.15.4.425